Improving Thread-Modular Abstract Interpretation
نویسندگان
چکیده
We give thread-modular non-relational value analyses as abstractions of a local trace semantics. The semantics well the are formulated by means global invariants and side-effecting constraint systems. show that generalization analysis provided static analyzer Goblint natural improvement Antoine Miné’s approach can be obtained instances this general scheme. these two incomparable w.r.t. precision provide refinement which improves on both precision-wise. also report preliminary experimental comparison given meaningful suite benchmarks.
منابع مشابه
Thread-Modular Verification Is Cartesian Abstract Interpretation
Verification of multithreaded programs is difficult. It requires reasoning about state spaces that grow exponentially in the number of concurrent threads. Successful verification techniques based on modular composition of over-approximations of thread behaviors have been designed for this task. These techniques have been traditionally described in assume-guarantee style, which does not admit re...
متن کاملRelational Thread-Modular Static Value Analysis by Abstract Interpretation
We study thread-modular static analysis by abstract interpretation to infer the values of variables in concurrent programs. We show how to go beyond the state of the art and increase an analysis precision by adding the ability to infer some relational and history-sensitive properties of thread interferences. The fundamental basis of this work is the formalization by abstract interpretation of a...
متن کاملPrecise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions
We present a static analysis by abstract interpretation of numeric properties in multi-threaded programs. The analysis is sound (assuming a sequentially consistent memory), parameterized by a choice of abstract domains and, in order to scale up, it is modular, in that it iterates over each thread individually (possibly several times) instead of iterating over their product. We build on previous...
متن کاملThread-Modular Abstraction Refinement
We present an algorithm called Tar (“Thread-modular Abstraction Refinement”) for model checking safety properties of concurrent software. The Tar algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded programs. Thread modularity means that Tar explores the state space of one thread at a time, making assumptions about...
متن کاملPrecise Thread-Modular Verification
Thread-modular verification is a promising approach for the verification of concurrent programs. Its high efficiency is achieved by abstracting the interaction between threads. The resulting polynomial complexity (in the number of threads) has its price: many interesting concurrent programs cannot be handled due to the imprecision of the abstraction. We propose a new abstraction algorithm for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88806-0_18